Graphs that are cospectral for the distance Laplacian

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Constructing cospectral graphs for the normalized Laplacian

We give a method to construct cospectral graphs for the normalized Laplacian by swapping edges between vertices in some special graphs. We also give a method to construct an arbitrarily large family of (non-bipartite) graphs which are mutually cospectral for the normalized Laplacian matrix of a graph. AMS 2010 subject classification: 05C50

متن کامل

Cospectral graphs for the normalized Laplacian by “toggling”

A characteristic of the normalized Laplacian matrix is the possibility for cospectral graphs which do not have the same number of edges. We give a construction of an infinite family of weighted graphs that are pairwise cospectral and which can be transformed into simple graphs. In particular, some of these graphs are cospectral with subgraphs of themselves. In the proof we deconstruct these gra...

متن کامل

Cospectral Bipartite Graphs for the Normalized Laplacian Table of Contents

We construct two infinite families of trees that are pairwise cospectral with respect to the normalized Laplacian. We also use the normalized Laplacian applied to weighed graphs to give new constructions of cospectral pairs of bipartite unweighted graphs.

متن کامل

A Construction of Cospectral Graphs for the Normalized Laplacian

We give a method to construct cospectral graphs for the normalized Laplacian by a local modification in some graphs with special structure. Namely, under some simple assumptions, we can replace a small bipartite graph with a cospectral mate without changing the spectrum of the entire graph. We also consider a related result for swapping out biregular bipartite graphs for the matrix A + tD. We p...

متن کامل

Cospectral graphs for both the adjacency and normalized Laplacian matrices

In this note we show how to construct two distinct bipartite graphs which are cospectral for both the adjacency and normalized Laplacian matrices by “unfolding” a base bipartite graph in two different ways.

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: The Electronic Journal of Linear Algebra

سال: 2020

ISSN: 1081-3810

DOI: 10.13001/ela.2020.4941